NLC-2 Graph Recognition and Isomorphism
نویسندگان
چکیده
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust $O(n^2 m)$-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.
منابع مشابه
Genetic-based search for error-correcting graph isomorphism
Error-correcting graph isomorphism has been found useful in numerous pattern recognition applications. This paper presents a genetic-based search approach that adopts genetic algorithms as the searching criteria to solve the problem of error-correcting graph isomorphism. By applying genetic algorithms, some local search strategies are amalgamated to improve convergence speed. Besides, a selecti...
متن کاملlog n - Approximative NLC k - Decomposition in O ( n 2 k + 1 ) Time Extended
NLCk for k = 1, . . . is a family of algebras on vertex-labeled graphs introduced by Wanke. An NLC-decomposition of a graph is a derivation of this graph from single vertices using the operations in question. The width of such a decomposition is the number of labels used, and the NLC-width of a graph is the minimum width among its NLC-decompositions. Many difficult graph problems can be solved ...
متن کاملThe NLC-width and clique-width for powers of graphs of bounded tree-width
The k-power graph of a graph G is a graphwith the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-treepower graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k + 2...
متن کاملProduct Recognition in Store Shelves as a Sub-Graph Isomorphism Problem
The arrangement of products in store shelves is carefully planned to maximize sales and keep customers happy. However, verifying compliance of real shelves to the ideal layout is a costly task routinely performed by the store personnel. In this paper, we propose a computer vision pipeline to recognize products on shelves and verify compliance to the planned layout. We deploy local invariant fea...
متن کاملOn the complexity of submap isomorphism and maximum common submap problems
Generalized maps describe the subdivision of objects in cells and are widely used to model 2D and 3D images. In this context, several pattern recognition tasks involve solving submap isomorphism problems (to decide if a map is included in another map) or, more generally, computing maximum common submaps (to measure the distance between two maps). Recently, we have described a polynomial-time al...
متن کامل